Characterizations of all-derivable points inB(H)
نویسندگان
چکیده
منابع مشابه
Mining All Non-derivable Frequent Itemsets
Recent studies on frequent itemset mining algorithms resulted in significant performance improvements. However, if the minimal support threshold is set too low, or the data is highly correlated, the number of frequent itemsets itself can be prohibitively large. To overcome this problem, recently several proposals have been made to construct a concise representation of the frequent itemsets, ins...
متن کاملOn Characterizations of Fixed Points
We give some necessary and sufficient conditions for the existence of fixed points of a family of self mappings of a metric space and we establish an equivalent condition for the existence of fixed points of a continuous compact mapping of a metric space. 2000 Mathematics Subject Classification. 54H25.
متن کاملCharacterizations of fixed points of nonexpansive mappings
Let C be a closed convex subset of a Banach space E. A mapping T on C is called a nonexpansive mapping if ‖Tx−Ty‖ ≤ ‖x− y‖ for all x, y ∈ C. We denote by F(T) the set of fixed points of T . Kirk [17] proved that F(T) is nonempty in the case that C is weakly compact and has normal structure. See also [2, 3, 5, 6, 11] and others. Convergence theorems to fixed points are also proved by many author...
متن کاملCharacterizations of Jordan derivations on triangular rings: Additive maps Jordan derivable at idempotents
Let T be a triangular ring. An additive map δ from T into itself is said to be Jordan derivable at an element Z ∈ T if δ(A)B +Aδ(B) + δ(B)A+Bδ(A) = δ(AB+BA) for any A,B ∈ T with AB + BA = Z. An element Z ∈ T is called a Jordan all-derivable point of T if every additive map Jordan derivable at Z is a Jordan derivation. In this paper, we show that some idempotents in T are Jordan all-derivable po...
متن کاملDerivable Type Classes
Generi programming allows you to write a fun tion on e, and use it many times at di erent types. A lot of good foundational work on generi programming has been done. The goal of this paper is to propose a pra ti al way of supporting generi programming within the Haskell language, without radi ally hanging the language or its type system. The key idea is to present generi programming as a ri her...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear and Multilinear Algebra
سال: 2015
ISSN: 0308-1087,1563-5139
DOI: 10.1080/03081087.2015.1091435